Cut–Free Axiomatizations for Stratified Modal Fixed Point Logic

نویسندگان

  • Gerhard Jäger
  • Mathis Kretz
  • Thomas Studer
چکیده

We present an infinitary and a finitary cut–free axiomatization for a fragment of the modal μ–calculus in which nesting of fixed points is restricted to non–interleaving occurrences. In this study we prove soundness and completeness of both axiomatizations. Completeness is established by constructing a canonical countermodel to any non– provable formula using an extension of the method of saturated sequents. Soundness of the finitary axiomatization is a consequence of the small model property and well–known results about monotone operators while completeness follows from the corresponding result for the infinitary case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A finitary cut-free axiomatization for stratified modal fixed point logic

The modal μ-calculus [5] is the extension of propositional modal logic with least and greatest fixed point operators. The μ-calculus is an important tool for specifying and verifying properties of programs and it has been thoroughly investigated. However, the deductive systems that are complete all contain a cut-rule [8, 9] and it is not known how to eliminate these cuts. At present, there is n...

متن کامل

The proof theory and semantics of intuitionistic modal logic

Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary meta-theory of informal classical mathematics. If, however, the same semantic definitions are interpreted in an intuitionistic metatheory then the induced modal logics no longer satisfy certain intuit...

متن کامل

Data Storage Interpretation of Labeled Modal Logic

We introduce reference structures { a basic mathematical model of a data organization capable to store and utilize information about its addresses. A propositional labeled modal language is used as a speciication and programming language for reference structures; the satissability algorithm for modal language gives a method of building and optimizing reference structures satisfying a given form...

متن کامل

Syntactic cut-elimination for a fragment of the modal mu-calculus

For some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elimination. An early example is the system in Pliuskevicius [15] for LTL. More recent examples are the systems by the authors of this paper for the logic of common knowledge [5] and by Hill and Poggiolesi for PDL [8], which are based on a form of deep inference. These logics can be seen as fragments of the ...

متن کامل

Proof Theory for Distributed Knowledge

The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from the totality of what the individual members of G know. There are known axiomatizations for epistemic logics with the distributed knowledge operator, but apparently no cut-free proof system for such logics has yet been...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005